Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
نویسندگان
چکیده
We introduce basic partial order reduction techniques in a temporal-epistemic setting. We analyse the semantics of interpreted systems with respect to the notions of trace-equivalence for the epistemic linear time logic LTLK −X .
منابع مشابه
An improvement in partial-order model-checking with ample sets
In [18], Peled describes a partial-order reduction method to alleviate the state-explosion problem for LTL model-checking, i.e. for verifying that concurrent programs satisfy their linear temporal logic specifications. We present an approach that improves the method in [18] by enabling a further reduction of the space and time required for LTL model-checking.
متن کاملA Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic
We introduce a symmetry reduction technique for model checking temporal-epistemic properties of multi-agent systems defined in the mainstream interpreted systems framework. The technique, based on counterpart semantics, aims to reduce the set of initial states that need to be considered in a model. We present theoretical results establishing that there are neither false positives nor false nega...
متن کاملPartial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems
We investigate partial order reduction for model checking multiagent systems by focusing on interleaved interpreted systems. These are a particular class of interpreted systems, a mainstream MAS formalism, in which only one action at the time is performed. We present a notion of stuttering-equivalence, and prove the semantical equivalence of stuttering-equivalent traces with respect to linear a...
متن کاملA Data Symmetry Reduction Technique for Temporal-epistemic Logic
We present a data symmetry reduction approach for model checking temporal-epistemic logic. The technique abstracts the epistemic indistinguishably relation for the knowledge operators, and is shown to preserve temporal-epistemic formulae. We show a method for statically detecting data symmetry in an ISPL program, the input to the temporalepistemic model checker MCMAS. The experiments we report ...
متن کاملPartial order reduction for model checking interleaved multi-agent systems
We investigate partial order reduction for model checking of multiagent systems by focusing on interleaved interpreted systems. These are a particular class of interpreted systems, a mainstream MAS formalism, in which only one action at the time is performed in the system. We present a notion of stutteringequivalence, and prove the semantical equivalence of stuttering-equivalent traces with res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008